Quotient-polynomial graphs

A Note on Strongly Quotient Graphs

The Hyper-Wiener Polynomial of Graphs

The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...

Zero-Divisor Graphs of Zn and Polynomial Quotient Rings over Zn

Critical to the understanding of a graph are its chromatic number and whether or not it is perfect. Here we prove when Γ(Zn), the zero-divisor graph of Zn, is perfect and show an alternative method to [D] for determining the chromatic number in those cases. We go on to determine the chromatic number for Γ(Zp[x]/〈x 〉) where p is prime and show that an isomorphism exists between this graph and Γ(...

on groups with specified quotient power graphs

abstract. in this paper we study some relations between the power andquotient power graph of a finite group. these interesting relations motivateus to find some graph theoretical properties of the quotient power graphand the proper quotient power graph of a finite group g. in addition, weclassify those groups whose quotient (proper quotient) power graphs areisomorphic to trees or paths.

a note on strongly quotient graphs

0